Stochastic inequalities for single-server loss queueing systems and their application
نویسنده
چکیده
The present paper provides some new stochastic inequalities for the characteristics of the M/GI/1/n and GI/M/1/n loss queueing systems. These stochastic inequalities are based on substantially deepen upand down-crossings analysis, and they are stronger than the known stochastic inequalities obtained earlier. Specifically, for a class of GI/M/1/n queueing system, two-side stochastic inequalities are obtained. These results are then used to obtain the bounds for the loss probability of that class of GI/M/1/n queueing systems and approximation of the loss probability by using these bounds. The results of the paper can be applied to analysis of losses in real telecommunication systems.
منابع مشابه
Stochastic inequalities for single-server loss queueing systems
The present paper provides some new stochastic inequalities for the characteristics of the M/GI/1/n and GI/M/1/n loss queueing systems. These stochastic inequalities are based on substantially deepen upand down-crossings analysis, and they are stronger than the known stochastic inequalities obtained earlier. Specifically, for a class of GI/M/1/n queueing system, two-side stochastic inequalities...
متن کاملTo appear in Stochastic Analysis and Applications STOCHASTIC INEQUALITIES FOR SINGLE-SERVER LOSS QUEUEING SYSTEMS
The present paper provides some new stochastic inequalities for the characteristics of the M/GI/1/n and GI/M/1/n loss queueing systems. These stochastic inequalities are based on substantially deepen upand downcrossings analysis, and they are stronger than the known stochastic inequalities obtained earlier. Specifically, for a class of GI/M/1/n queueing system, twoside stochastic inequalities a...
متن کاملNetwork Location Problem with Stochastic and Uniformly Distributed Demands
This paper investigates the network location problem for single-server facilities that are subject to congestion. In each network edge, customers are uniformly distributed along the edge and their requests for service are assumed to be generated according to a Poisson process. A number of facilities are to be selected from a number of candidate sites and a single server is located at each facil...
متن کاملTel Aviv University School of Mathematical Science Asymptotic Methods for Queueing Systems and Networks with Application to Telecommunications
This dissertation is concerned with the study of non-Markovian queueing systems and networks, with applications to communication networks. The main contribution of the dissertation consists in deriving results for non-Markovian networks that have been obtained so far only for Markovian queueing networks. We study large closed client/server communication networks and losses in single-server queu...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2005